Constructing Binary Sequences with Optimal Peak Sidelobe Level: An Efficient Analytical-Computational Interplay
نویسندگان
چکیده
Binary sequence sets with asymptotically optimal auto/cross-correlation peak sidelobe level (PSL) growth have been known in the literature for a long time, and their construction has been studied both analytically and numerically. In contrast, it has been a long-standing problem whether we can construct a family of binary sequences whose auto-correlation PSL grows in an optimal manner. In this paper, we devise a construction of such binary sequences from sequence sets with good correlation properties. A key component of the design follows from the observation that if the PSL of the sequence set grows optimally, then the PSL of the constructed binary sequence will experience an optimal growth as a consequence. The proposed construction is simple-to-implement, and is shown to be accomplished in polynomial-time. With such a construction, we not only bridge between analytical construction and computational search, but also settle the long-standing design problem of binary sequences with an optimal growth of the auto-correlation PSL.
منابع مشابه
Binary Sequences with Minimum Peak Sidelobe Level up to Length 68
Results of an exhaustive search for minimum peak sidelobe level binary sequences are presented. Several techniques for efficiency implementation of search algorithm are described. A table of number of non-equivalent optimal binary sequences with minimum peak sidelobe (MPS) level up to length 68 is given. This number can be used in prediction of the longest length for a given sidelobe level of b...
متن کاملWaveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملImproved bounds on the peak sidelobe level of binary sequences
Schmidt proved in 2014 that if ε > 0, almost all binary sequences of length n have peak sidelobe level between ( √ 2 − ε)√n log n and ( √ 2 + ε) √ n log n. Because of the small gap between his upper and lower bounds, it is difficult to find improved upper bounds that hold for almost all binary sequences. In this note, we prove that if ε > 0, then almost all binary sequences of length n have pea...
متن کاملExtending the Radar Dynamic Range using Adaptive Pulse Compression
The matched filter in the radar receiver is only adapted to the transmitted signal version and its output will be wasted due to non-matching with the received signal from the environment. The sidelobes amplitude of the matched filter output in pulse compression radars are dependent on the transmitted coded waveforms that extended as much as the length of the code on both sides of the target loc...
متن کاملBounds on the growth rate of the peak sidelobe level of binary sequences
The peak sidelobe level (PSL) of a binary sequence is the largest absolute value of all its nontrivial aperiodic autocorrelations. A classical problem of digital sequence design is to determine how slowly the PSL of a length n binary sequence can grow, as n becomes large. Moon and Moser showed in 1968 that the growth rate of the PSL of almost all length n binary sequences lies between order √ n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016